SMLSOM: The shrinking maximum likelihood self-organizing map

نویسندگان

چکیده

Determining the number of clusters in a dataset is fundamental issue data clustering. Many methods have been proposed to solve problem selecting clusters, considering it be with regard model selection. This paper proposes an efficient algorithm that automatically selects suitable based on probability distribution framework. The includes following two components. First, generalization Kohonen's self-organizing map (SOM) introduced. In SOM, are modeled as mean vectors. generalized each cluster probabilistic and constructed by samples classified likelihood. Second, dynamically updating method SOM structure tied node fixed two-dimensional lattice space learned using neighborhood relations between nodes Euclidean distance. extended defines graph vertices links updates cutting weakly connected unnecessary vertex deletions. weakness link measured Kullback–Leibler divergence, redundancy minimum description length. Those extensions make determine appropriate clusters. Compared existing methods, computationally can accurately select

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lifestyle patterns in the Iranian population: Self- organizing map application

Background: The present study evaluated the lifestyle behavior patterns and its associations with demographic factors in the Iranian population. Methods: A total of 8244 people aged 25-70 years who participated in a national survey in 2011 were included in the study. Factors related to lifestyle (such as diet, physical activity, and tobacco use) have been collected using a questionnaire. A sel...

متن کامل

The Time Adaptive Self Organizing Map for Distribution Estimation

The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...

متن کامل

The Self-organizing Map

information from multidimensional primary signals, and to represent it as a location, say, in a two-dimensional network. Although this i s already a step towards generalization and symbolism, it must be admitted that the extraction of features from geometrically or physically relatable data elements i s still a very concrete task, in principle at least. Theoperation of the brain at the higher l...

متن کامل

Maximum Likelihood Topographic Map Formation

We introduce a new unsupervised learning algorithm for kernel-based topographic map formation of heteroscedastic gaussian mixtures that allows for a unified account of distortion error (vector quantization), log-likelihood, and Kullback-Leibler divergence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics & Data Analysis

سال: 2023

ISSN: ['0167-9473', '1872-7352']

DOI: https://doi.org/10.1016/j.csda.2023.107714